Robust Distance-Based Watermarking for Digital Video
نویسندگان
چکیده
In this paper, a mechanism of a distance-based algorithm is highlighted and tested to invisibly watermark a digital video (cover object) using an iconic image (watermark object). The algorithm is based on the distances among the addresses of values of the cover object. These distances are used to make the embedding. The order of manipulating these distances are specified by the values of the watermark data which is dealt with serially. The algorithm achieves a self encryption key. Each watermark object has its unique pattern of distances at different possible lengths of distance bits. This enhances the complexity of sequential embedding. The blind and non-blind algorithm are tested using direct (spatial) and first level Two Dimensional Discrete Wavelet Transform (2D DWT) embeddings. The algorithm shows resisting and withstanding against the most important attacks. Some of these include lossy compression, frame averaging, frame swapping, and frame dropping. CR Categories: I.4.9 [Computing Methodologies]: Image Processing and Computer Vision—Applications; E.4 [Coding and Information theory]
منابع مشابه
Robust multiplicative video watermarking using statistical modeling
The present paper is intended to present a robust multiplicative video watermarking scheme. In this regard, the video signal is segmented into 3-D blocks like cubes, and then, the 3-D wavelet transform is applied to each block. The low frequency components of the wavelet coefficients are then used for data embedding to make the process robust against both malicious and unintentional attacks. Th...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملA Robust Digital Image Watermarking Scheme Based on DWT
In this paper a wavelet-based logo watermarking scheme is presented. The logo watermark is embedded into all sub-blocks of the LLn sub-band of the transformed host image, using quantization technique. Extracted logos from all sub-blocks are merged to make the extracted watermark from distorted watermarked image. Knowing the quantization step-size, dimensions of logo and the level of wavelet tra...
متن کاملA Robust Digital Image Watermarking Scheme Based on DWT
In this paper a wavelet-based logo watermarking scheme is presented. The logo watermark is embedded into all sub-blocks of the LLn sub-band of the transformed host image, using quantization technique. Extracted logos from all sub-blocks are merged to make the extracted watermark from distorted watermarked image. Knowing the quantization step-size, dimensions of logo and the level of wavelet tra...
متن کاملTwo Novel Chaos-Based Algorithms for Image and Video Watermarking
In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008